Optimally Sensing a Single Channel Without Prior Information: The Tiling Algorithm and Regret Bounds
نویسندگان
چکیده
منابع مشابه
Single Image Dehazing Algorithm Based on Dark Channel Prior and Inverse Image
The sky regions of foggy image processed by all the existing conventional dehazing methods are degraded by color distortion and severe noise. This paper proposes an improved algorithm which combines dark channel prior and inverse image. We first invert the foggy image, and then estimate the transmission of the inverse image. At last, compared with the non-inversed transmission, the larger value...
متن کاملCompressed Sensing with Prior Information: Optimal Strategies, Geometry, and Bounds
We address the problem of compressed sensing (CS) with prior information: reconstruct a target CS signal with the aid of a similar signal that is known beforehand, our prior information. We integrate the additional knowledge of the similar signal into CS via l1-l1 and l1-l2 minimization. We then establish bounds on the number of measurements required by these problems to successfully reconstruc...
متن کاملRegret Analysis of the Anytime Optimally Confident UCB Algorithm
Abstract I introduce and analyse an anytime version of the Optimally Confident UCB (OCUCB) algorithm designed for minimising the cumulative regret in finitearmed stochastic bandits with subgaussian noise. The new algorithm is simple, intuitive (in hindsight) and comes with the strongest finite-time regret guarantees for a horizon-free algorithm so far. I also show a finite-time lower bound that...
متن کاملRegret Bounds for Opportunistic Channel Access
We consider the task of opportunistic channel access in a primary system composed of independent Gilbert-Elliot channels where the secondary (or opportunistic) user does not dispose of a priori information regarding the statistical characteristics of the system. It is shown that this problem may be cast into the framework of model-based learning in a specific class of Partially Observed Markov ...
متن کاملStrongly Adaptive Regret Implies Optimally Dynamic Regret
To cope with changing environments, recent developments in online learning have introduced the concepts of adaptive regret and dynamic regret independently. In this paper, we illustrate an intrinsic connection between these two concepts by showing that the dynamic regret can be expressed in terms of the adaptive regret and the functional variation. This observation implies that strongly adaptiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Journal of Selected Topics in Signal Processing
سال: 2011
ISSN: 1932-4553,1941-0484
DOI: 10.1109/jstsp.2010.2058091